New Trends in Metaheuristics and their Applications

نویسندگان

  • Imed Kacem
  • Peng-Yeng Yin
چکیده

This special issue consists of five papers that present new trends on metaheuristics and their applications in industrial engineering and science. In the first paper, Marinakis, Marinaki, Matsatsinis and Zopounidis propose a discrete artificial bee colony optimization to solve a financial classification problem involving credit risk assessment. The proposed method uses also local search based classifiers. The performance of the method is evaluated on several benchmark instances. The obtained results are compared to the performances of other well-known metaheuristics. In the second paper, Kessentini, Bar-chiesi, Grosges, Giraud-Moreau and Lamy de la Chapelle describe a non-uniform adapted Particle Swarm Optimization (PSO) to solve a plasmonic problem. The method is tested and compared to several other metaheuristics such as the standard Particle Swarm Optimization (PSO), the meta-PSO (by Veenhuis, 2006) and the ANUHEM (by Barchiesi, 2009). All these approaches are applied to the specific problem of the optimization of Surface Plasmon Resonance Biosensors design. The obtained results show the effectiveness of the proposed approach. An integrated ant colony optimization is reported in the third paper by Khalouli, Ghed-jati, and Hamzaoui to solve the multistage hybrid flow-shop scheduling problem, with the aim of minimizing the makespan (the date of completion of the last job). The proposed method considers jointly the assignment and the sequencing sub-problems. The method is evaluated by testing several benchmark instances from the literature. The numerical experiments show the performance of the proposed algorithm compared to other existing methods. The contribution of the fourth paper consists in a Discrete Particle Swarm Optimization (DPSO) approach for the Multi-Level Lot-Sizing Problem (MLLP). In the above work, Deroussi and Lemoine consider an uncapaci-tated lot sizing problem dedicated to materials requirements planning (MRP) systems. The specificity of their DPSO approach is based on the cost modification and the use of the PSO in its original form, by using continuous velocity equations. The authors show that the proposed DPSO can reach the solution of the MLLP. The proposed DPSO method is tested on benchmark instances from the literature. The obtained results confirm the efficiency of the proposed method, in particular, compared to the unique DPSO already developed in the literature to solve the MLLP. In the fifth paper Euchi, Chabchoub and Yassine propose an Iterated Density Estimation Evolutionary Algorithm (IDEEA) with i

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

New Approaches in Metaheuristics to Solve the Truck Scheduling Problem in a Cross-docking Center

Nowadays, cross-docking is one of the main concepts in supply chain management in which products received to a distribution center by inbound trucks which are directly to lead into outbound trucks with a minimum handling and storage costs as the main cost of a cross-docking system. According to the literature, several metaheuristics and heuristics are attempted to solve this optimization model....

متن کامل

Solving the Fixed Charge Transportation Problem by New Heuristic Approach

The fixed charge transportation problem (FCTP) is a deployment of the classical transportation problem in which a fixed cost is incurred, independent of the amount transported, along with a variable cost that is proportional to the amount shipped. Since the problem is considered as an NP-hard, the computational time grows exponentially as the size of the problem increases. In this pape...

متن کامل

Parallel Metaheuristics

Metaheuristic parallel search methods { tabu search, simulated annealing and genetic algorithms, essentially { are reviewed, classi ed and examined not according to particular methodological characteristics, but following the unifying approach of the level of parallelization. It is hoped that by examining the commonalities among parallel implementations across the eld of metaheuristics, insight...

متن کامل

Parallel metaheuristics: recent advances and new trends

The field of parallel metaheuristics is continuously evolving as a result of new technologies and needs that researchers have been encountering. In the last decade, new models of algorithms, new hardware for parallel execution/communication, and new challenges in solving complex problems have been making advances in a fast manner. We aim to discuss here on the state of the art, in a summarized ...

متن کامل

A Review on Energy Storage Systems Planning in Active Distribution Networks and its Applications

With the restructuring of power systems, increase of renewable energy sources, and as networks become smarter, power systems are facing new challenges such as uncertainty in available energy resources. An appropriate solution to address these challenges are to use energy storage systems. Therefore, sizing, location, and selection of energy storage systems are important to maximize their benefit...

متن کامل

Metaheuristics in Combinatorial Optimization

The emergence of metaheuristics for solving diÆcult combinatorial optimization problems is one of the most notable achievements of the last two decades in operations research. This paper provides an account of the most recent developments in the eld and identi es some common issues and trends. Examples of applications are also reported for vehicle routing and scheduling problems.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011